Deenitional Constraints
نویسندگان
چکیده
Certain constraints that should be interpreted as deenitions or quasi-deenitions can cause prediction problems for logics of action. Standard ways to avoid them rely on notions of priority in the minimization of uent change. We ooer an alternative approach based on belief revision. Revision is performed on the reduct of the system theory after isolating deenitions, and the revised theory is then expanded by restoring the deenitions. The basis for this is a weak monotonicity result for AGM contraction. Examples from the literature are used to illustrate the approach.
منابع مشابه
A Definitional Approach to Functional Logic Programming
We describe a deenitional approach to the combination of functional and logic programming based on the theory of Partial Induc-tive Deenitions. The described method produces programs directly exe-cutable in the deenitional programming language GCLA. We show both a basic calculus for functional logic program deenitions and discuss a reened version where the rules deenitional resolution, deenitio...
متن کاملIterative Re nement of Knowledge Bases with Consistency Guarantees
Natural kinds, such as the concepts toy block or photosynthesis, are ubiquitous in human reasoning yet lack deenitional (i.e., individually necessary and jointly suucient) properties as membership conditions. We want to represent a wide variety of assertions about these natural concepts with precision and logical consistency. Furthermore , we want to be able to verify that the meaning of each c...
متن کاملFalcon: Functional and Logic Language with Constraints
A draft prepared for the chapter 6 of my Ph.D thesis: Deenition al Constraint Programming 1 This chapter presents a deenitional constraint language, Falcon (Functional And Logic language with CONstraints) designed to integrate functional and logic programming languages. Syntactically, Falcon features guarded functional rewrite rules and relations deended over functional expressions. Constraints...
متن کاملOn the Practical Value of Di erent De nitionalTranslations to Normal Form ?
In this paper, we compare diierent normal form translations from a practical point of view. The usual translation of a closed rst-order formula to a disjunctive normal form has severe drawbacks, namely the disruption of the formula's structure and an exponential worst case complexity. In contrast, deenitional translations avoid these drawbacks by introducing some additional new predicates yield...
متن کامل